A Note On the Storage Requirement for AKS Primality Testing Algorithm
نویسنده
چکیده
We remark that AKS primality testing algorithm needs about 1,000,000,000 G (gigabyte) storage space for a number of 1024 bits. Such storage requirement is hard to meet in practice. To the best of our knowledge, it is impossible for current operating systems to write and read data in so huge storage space. Thus, the running time for AKS algorithm should not be simply estimated as usual in terms of the amount of arithmetic operations.
منابع مشابه
Remarks on AKS Primality Testing Algorithm and A Flaw in the Definition of P
We remark that the AKS primality testing algorithm [Annals of Mathematics 160 (2), 2004] needs about 1,000,000,000 G (gigabyte) storage space for a number of 1024 bits. The requirement is very hard to meet. The complexity class P which contains all decision problems that can be solved by a deterministic Turing machine using a polynomial amount of computation time, is generally believed to be “e...
متن کاملSome remarks and questions about the AKS algorithm and related conjecture
We show that AKS-algorithm for primality testing ( see [1]) can be modified to run in Õ(log n) time. We present some remarks and ask two questions related to this algorithm.
متن کاملOn Derandomizing Tests for Certain Polynomial Identities
We extract a paradigm for derandomizing tests for polynomial identities from the recent AKS primality testing algorithm. We then discuss its possible application to other tests.
متن کاملAn Empirical Study towards Refining the AKS Primality Testing Algorithm
The AKS (Agrawal-Kayal-Saxena) algorithm is the first ever deterministic polynomialtime primality-proving algorithm whose asymptotic run time complexity is O(log n), where > 0. Despite this theoretical breakthrough, the algorithm serves no practical use in conventional cryptologic applications, as the existing probabilistic primality tests like ECPP in conjunction with conditional usage of sub-...
متن کاملTowards the Verification of The AKS Primality Test in ACL2
In this paper we present a recursive implementation of the Agrawal, Kayal and Saxena primality testing algorithm, which is the first unconditional deterministic polynomial time primality testing algorithm. Since the algorithm’s proof of correctness makes use of informal notation and omits many key steps, we present the progress made toward using ACL2 to verify the algorithm’s correctness. In pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2013 شماره
صفحات -
تاریخ انتشار 2013